<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
   "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8"/>
<head>
    <title>Jumper documentation</title>
    <link rel="stylesheet" href="../ldoc.css" type="text/css" />
</head>
<body>

<div id="container">

<div id="product">
	<div id="product_logo"></div>
	<div id="product_name"><big><b></b></big></div>
	<div id="product_description"></div>
</div> <!-- id="product" -->


<div id="main">


<!-- Menu -->

<div id="navigation">
<br/>
<h1>Jumper</h1>

<ul>
  <li><a href="../index.html">Index</a></li>
</ul>



<h2>Scripts</h2>
<ul>
  <li><a href="../scripts/search.astar.html">search.astar</a></li>
  <li><a href="../scripts/search.bfs.html">search.bfs</a></li>
  <li><a href="../scripts/search.dfs.html">search.dfs</a></li>
  <li><a href="../scripts/search.dijkstra.html">search.dijkstra</a></li>
  <li><strong>search.jps</strong></li>
</ul>
<h2>Modules</h2>
<ul>
  <li><a href="../modules/jumper.core.bheap.html">jumper.core.bheap</a></li>
  <li><a href="../modules/jumper.core.heuristics.html">jumper.core.heuristics</a></li>
  <li><a href="../modules/jumper.core.node.html">jumper.core.node</a></li>
  <li><a href="../modules/jumper.core.path.html">jumper.core.path</a></li>
  <li><a href="../modules/jumper.grid.html">jumper.grid</a></li>
  <li><a href="../modules/jumper.pathfinder.html">jumper.pathfinder</a></li>
</ul>

</div>

<div id="content">

<h1>Script <code>search.jps</code></h1>

<p><strong><code>Jump Point Search</code> algorithm</strong>.</p>
<p> This file holds an implementation of <a href="http://harablog.wordpress.com/2011/09/07/jump-point-search/">Jump Point Search</a> algorithm.
 To quote its authors, <strong>Jump Point Search</strong> is basically
 "<em>an online symmetry breaking algorithm which speeds up pathfinding
 on uniform-cost grid maps by <strong>jumping over</strong> many locations that would otherwise
 need to be explicitly considered</em> ".</p>

<p> It neither requires preprocessing, nor generates memory overhead, and thus performs consistently fast than classical A*.</p>

<p> The following implementation was written with respect to the core pseudo-code given in
 its <a href="http://users.cecs.anu.edu.au/~dharabor/data/papers/harabor-grastien-aaai11.pdf">
 technical papers,</a> plus a wide
 range of optimizations and additional features.</p>
    <h3>Info:</h3>
    <ul>
        <li><strong>Copyright</strong>: 2012-2013</li>
        <li><strong>License</strong>: <a href="http://www.opensource.org/licenses/mit-license.php">MIT</a></li>
        <li><strong>Author</strong>: Roland Yonaba</li>
    </ul>



<br/>
<br/>




</div> <!-- id="content" -->
</div> <!-- id="main" -->
<div id="about">
<i>generated by <a href="http://github.com/stevedonovan/LDoc">LDoc 1.3</a></i>
</div> <!-- id="about" -->
</div> <!-- id="container" -->
</body>
</html>
